Updating TBoxes in DL-Lite
نویسندگان
چکیده
We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of OWL 2, the recently proposed revision of the Web Ontology Language. In this paper, we address for the first time the problem of updating TBoxes. We propose some principles that TBox updates should respect. We review known modeland formula-based approaches for updates of logical theories, and exhibit limitations of model-based approaches to handle TBox updates. We propose a novel formula-based approach, and present a polynomial time algorithm to compute TBox updates for DL-LiteFR. We also study the relationship between propositional logic satisfiability for Horn clauses and computation of TBox updates for DL-Lite.
منابع مشابه
Adding DL-Lite TBoxes to Proper Knowledge Bases
Levesque’s proper knowledge bases (proper KBs) correspond to infinite sets of ground positive and negative facts, with the notable property that for FOL formulas in a certain normal form, which includes conjunctive queries and positive queries possibly extended with a controlled form of negation, entailment reduces to formula evaluation. However proper KBs represent extensional knowledge only. ...
متن کاملContraction and Revision over DL-Lite TBoxes
Two essential tasks in managing Description Logic (DL) ontologies are eliminating problematic axioms and incorporating newly formed axioms. Such elimination and incorporation are formalised as the operations of contraction and revision in belief change. In this paper, we deal with contraction and revision for the DL-Lite family through a model-theoretic approach. Standard DL semantics yields in...
متن کاملBelief Contraction and Revision over DL-Lite TBoxes
In this paper, we study the operations of contraction and revision for removing and incorporating axioms over DL-Litecore and DL-LiteR TBoxes (Calvanese et al. 2007). The operations are defined in the manner of AGM model-based contraction and revision (Grove 1988; Katsuno and Mendelzon 1992) and are based on a newly defined semantics called type semantics. We show that, as an alternative to des...
متن کاملHigh Performance Query Answering over DL-Lite Ontologies
Current techniques for query answering over DL-Lite ontologies have severe limitations in practice, since they either produce complex queries that are inefficient during execution, or require expensive data pre-processing. In light of this, we present two complementary sets of results that aim at improving the overall peformance of query answering systems. We show how to create ABox repositorie...
متن کاملUpdating RDFS ABoxes and TBoxes in SPARQL
Updates in RDF stores have recently been standardised in the SPARQL 1.1 Update specification. However, computing answers entailed by ontologies in triple stores is usually treated orthogonal to updates. Even the W3C’s recent SPARQL 1.1 Update language and SPARQL 1.1 Entailment Regimes specifications explicitly exclude a standard behaviour how SPARQL endpoints should treat entailment regimes oth...
متن کامل